There Exist Binary Circular $5/2^+$ Power Free Words of Every Length

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

There Exist Binary Circular 5/2+ Power Free Words of Every Length

We show that there exist binary circular 5/2+ power free words of every length.

متن کامل

Length-k-overlap-free Binary Infinite Words

We study length-k-overlap-free binary infinite words, i.e., binary infinite words which can contain only overlaps xyxyx with |x| ≤ k− 1. We prove that no such word can be generated by a morphism, except if k = 1. On the other hand, for every k ≥ 2, there exist length-k-overlap-free binary infinite words which are not length-(k−1)-overlap-free. As an application, we prove that, for every non-neg...

متن کامل

There Are Ternary Circular Square-Free Words of Length n for n >= 18

There are circular square-free words of length n on three symbols for n ≥ 18. This proves a conjecture of R. J. Simpson.

متن کامل

Minimal Letter Frequency in n-th Power-Free Binary Words

We show that the minimal proportion of one letter in an n-th power-free binary word is asymptotically 1=n. We also consider a generalization of n-th power-free words deened through the notion of exponent: a word is x-th power-free for a real x, if it does not contain subwords of exponent x or more. We study the minimal proportion of one letter in an x-th power-free binary word as a function of ...

متن کامل

On Weak Circular Squares in Binary Words

A weak square in a binary word is a pair of adjacent non-empty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2004

ISSN: 1077-8926

DOI: 10.37236/1763